A Topic Model for Linked Documents and Update Rules for its Estimation.
The latent topic model plays an important role in the unsupervised learning from a corpus, which provides a probabilistic interpretation of the corpus in terms of the latent topic space. An underpinning assumption which most of the topic models are based on is that the documents are assumed to be independent of each other. However, this assumption does not hold true in reality and the relations among the documents are available in different ways, such as the citation relations among the research papers. To address this limitation, in this paper we present a Bernoulli Process Topic (BPT) model, where the interdependence among the documents is modeled by a random Bernoulli process. In the BPT model a document is modeled as a distribution over topics that is a mixture of the distributions associated with the related documents. Although BPT aims at obtaining a better document modeling by incorporating the relations among the documents, it could also be applied to many applications including detecting the topics from corpora and clustering the documents. We apply the BPT model to several document collections and the experimental comparisons against several state-of-the-art approaches demonstrate the promising performance.
Overview of ACM international workshop on connected multimedia.

Local Outlier Detection Based on Kernel Regression.

Unsupervised Learning from Linked Documents.
The latent topic model plays an important role in the unsupervised learning from a corpus, which provides a probabilistic interpretation of the corpus in terms of the latent topic space. An underpinning assumption which most of the topic models are based on is that the documents are assumed to be independent of each other. However, this assumption does not hold true in reality and the relations among the documents are available in different ways, such as the citation relations among the research papers. To address this limitation, in this paper we present a Bernoulli Process Topic (BPT) model, where the interdependence among the documents is modeled by a random Bernoulli process. In the BPT model a document is modeled as a distribution over topics that is a mixture of the distributions associated with the related documents. Although BPT aims at obtaining a better document modeling by incorporating the relations among the documents, it could also be applied to many applications including detecting the topics from corpora and clustering the documents. We apply the BPT model to several document collections and the experimental comparisons against several state-of-the-art approaches demonstrate the promising performance.
Multimedia Data Mining.
Is multimedia data mining just a new combination of buzz-words  or is it a new interdisciplinary field which not only incorporates  methods and techniques from the relevant disciplines, but is also  capable to produce new methodologies and influence related  interdisciplinary fields. Rather than making an overview of  existing methods and techniques, or presenting a particular  technique, this paper aims to present some facets of multimedia  data mining in the context of its potential to influence some  relatively new interdisciplinary domains.  Keywords  multimedia, digital media, data mining, knowledge discovery, knowledge representation, case-based reasoning, computersupported collaborative work.  1. INTRODUCTION  Multimedia and digital media, and data mining are perhaps among the top ten most overused terms in the last decade. The field of multimedia and digital media is at the intersection of several major fields, including computing, telecommunications, desktop publishing, digita...
A general framework for relation graph clustering.

Linear discriminant analysis using rotational invariant L1 norm.
Linear Discriminant Analysis (LDA) is a well-known scheme for supervised subspace learning. It has been widely used in the applications of computer vision and pattern recognition. However, an intrinsic limitation of LDA is the sensitivity to the presence of outliers, due to using the Frobenius norm to measure the inter-class and intra-class distances. In this paper, we propose a novel rotational invariant L1 norm (i.e., R1 norm) based discriminant criterion (referred to as DCL1), which better characterizes the intra-class compactness and the inter-class separability by using the rotational invariant L1 norm instead of the Frobenius norm. Based on the DCL1, three subspace learning algorithms (i.e., 1DL1, 2DL1, and T DL1) are developed for vector-based, matrix-based, and tensor-based representations of data, respectively. They are capable of reducing the influence of outliers substantially, resulting in a robust classification. Theoretical analysis and experimental evaluations demonstrate the promise and effectiveness of the proposed DCL1 and its algorithms.

Robust object tracking using a spatial pyramid heat kernel structural information representation.
In this paper, we propose an object tracking framework based on a spatial pyramid heat kernel structural information representation. In the tracking framework, we take advantage of heat kernel structural information (HKSI) matrices to represent object appearance, because HKSI matrices perform well in characterizing the edge flow (or structural) information on the object appearance graph. To further capture the multi-level spatial layout information of the HKSI matrices, a spatial pyramid division strategy is adopted. Then, multi-scale HKSI subspace analysis is applied to each spatial pyramid grid at different levels. As a result, several grid-specific HKSI subspace models are obtained and updated by the incremental PCA algorithm. Based on the multi-scale grid-specific HKSI subspace models, we propose a tracking framework using a particle filter to propagate sample distributions over time. Theoretical analysis and experimental evaluations demonstrate the effectiveness of the proposed tracking framework.

Knowledge Discovery from Citation Networks.
Abstract—Knowledge discovery from scientific articles has received increasing attentions recently since huge repositories are made available by the development of the Internet and digital databases. In a corpus of scientific articles such as a digital library, documents are connected by citations and one document plays two different roles in the corpus: document itself and a citation of other documents. In the existing topic models, little effort is made to differentiate these two roles. We believe that the topic distributions of these two roles are different and related in a certain way. In this paper we propose a Bernoulli Process Topic (BPT) model which models the corpus at two levels: document level and citation level. In the BPT model, each document has two different representations in the latent topic space associated with its roles. Moreover, the multilevel hierarchical structure of the citation network is captured by a generative process involving a Bernoulli process. The distribution parameters of the BPT model are estimated by a variational approximation approach. In addition to conducting the experimental evaluations on the document modeling task, we also apply the BPT model to a well known scientific corpus to discover the latent topics. The comparisons against state-ofthe-art methods demonstrate a very promising performance. Keywords-Unsupervised learning; latent models; text mining I.
Towards developing a unified multimodal image retrieval framework.

A latent topic model for linked documents.

Clustering on Complex Graphs.
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and epidemiology. In this study, We propose a general framework for clustering on complex graphs. Under this framework, we derive a family of clustering algorithms including both hard and soft versions, which are capable of learning cluster patterns from complex graphs with various structures and statistical properties. We also establish the connections between the proposed framework and the traditional graph partitioning approaches. The experimental evaluation provides encouraging results to validate the proposed framework and algorithms.
Visual tracking via incremental Log%2DEuclidean Riemannian subspace learning.

Robust Visual Tracking Based on an Effective Appearance Model.

Robust Visual Tracking Based on an Effective Appearance Model.

Dirichlet Process Based Evolutionary Clustering.
Evolutionary Clustering has emerged as an important research topic in recent literature of data mining, and solutions to this problem have found a wide spectrum of applications, particularly in social network analysis. In this paper, based on the recent literature on Dirichlet processes, we have developed two different and specific models as solutions to this problem: DPChain and HDP-EVO. Both models substantially advance the literature on evolutionary clustering in the sense that not only they both perform better than the existing literature, but more importantly they are capable of automatically learning the cluster numbers and structures during the evolution. Extensive evaluations have demonstrated the effectiveness and promise of these models against the state-of-the-art literature. 1
Evolutionary Clustering by Hierarchical Dirichlet Process with Hidden Markov State.
This paper studies evolutionary clustering, which is a recently hot topic with many important applications, noticeably in social network analysis. In this paper, based on the recent literature on Hierarchical Dirichlet Process (HDP) and Hidden Markov Model (HMM), we have developed a statistical model HDP-HTM that combines HDP with a Hierarchical Transition Matrix (HTM) based on the proposed Infinite Hierarchical Hidden Markov State model (iH2MS) as an effective solution to this problem. The HDP-HTM model substantially advances the literature on evolutionary clustering in the sense that not only it performs better than the existing literature, but more importantly it is capable of automatically learning the cluster numbers and structures and at the same time explicitly addresses the correspondence issue during the evolution. Extensive evaluations have demonstrated the effectiveness and promise of this solution against the state-of-the-art literature. 1
Multiclass spectral clustering based on discriminant analysis.

Supervised Learning for Head Pose Estimation Using SVD and Gabor Wavelets.

Robust foreground segmentation based on two effective background models.
Foreground segmentation is a common foundation for many computer vision applications such as tracking and behavior analysis. Most existing algorithms for foreground segmentation learn pixelbased statistical models, which are sensitive to dynamic scenes such as illumination change, shadow movement, and swaying trees. In order to address this problem, we propose two block-based background models using the recently developed incremental rank-(R1, R2, R3) tensor-based subspace learning algorithm (referred to as IRTSA) [1]. These two IRTSA-based background models (i.e., IRTSA-GBM and IRTSA-CBM respectively for grayscale and color images) incrementally learn low-order tensor-based eigenspace representations to fully capture the intrinsic spatio-temporal characteristics of a scene, leading to robust foreground segmentation results. Theoretic analysis and experimental evaluations demonstrate the promise and effectiveness of the proposed background models.
Semi%2DSupervised Learning Based on Semiparametric Regularization.
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many data mining applications in recent years. This paper addresses the semi-supervised learning problem by developing a semiparametric regularization based approach, which attempts to discover the marginal distribution of the data to learn the parametric function through exploiting the geometric distribution of the data. This learned parametric function can then be incorporated into the supervised learning on the available labeled data as the prior knowledge. Specifically, our contributions are: (1) We present a semi-supervised learning approach which incorporates the unlabeled data into the supervised learning by a parametric function learned from the whole data including the labeled and unlabeled data. The parametric function reflects the geometric structure of the marginal distribution of the data. Furthermore, the proposed approach which naturally extends to the out-of-sample data is an inductive learning method in nature. (2) This approach allows a family of algorithms to be developed based on various choices of the original RKHS and the loss function. (3) We provide experimental comparisons showing that the proposed approach leads the state-of-the-art performance on a variety of classification tasks. In particular, we demonstrate that this approach can be used successfully in both transductive and semisupervised settings. 1
Mining Bulletin Board Systems Using Community Generation.

Semi%2DSupervised Learning Based on Semiparametric Regularization.
Semi-supervised learning plays an important role in the recent literature on machine learning and data mining and the developed semisupervised learning techniques have led to many data mining applications in recent years. This paper addresses the semi-supervised learning problem by developing a semiparametric regularization based approach, which attempts to discover the marginal distribution of the data to learn the parametric function through exploiting the geometric distribution of the data. This learned parametric function can then be incorporated into the supervised learning on the available labeled data as the prior knowledge. Specifically, our contributions are: (1) We present a semi-supervised learning approach which incorporates the unlabeled data into the supervised learning by a parametric function learned from the whole data including the labeled and unlabeled data. The parametric function reflects the geometric structure of the marginal distribution of the data. Furthermore, the proposed approach which naturally extends to the out-of-sample data is an inductive learning method in nature. (2) This approach allows a family of algorithms to be developed based on various choices of the original RKHS and the loss function. (3) We provide experimental comparisons showing that the proposed approach leads the state-of-the-art performance on a variety of classification tasks. In particular, we demonstrate that this approach can be used successfully in both transductive and semisupervised settings. 1
A General Model for Multiple View Unsupervised Learning.
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bioinformatics and social network analysis. Since different representations could have very different statistical properties, how to learn a consensus pattern from multiple representations is a challenging problem. In this paper, we propose a general model for multiple view unsupervised learning. The proposed model introduces the concept of mapping function to make the different patterns from different pattern spaces comparable and hence an optimal pattern can be learned from the multiple patterns of multiple representations. Under this model, we formulate two specific models for
Improving Web search using image snippets.

Editorial Introduction to the Special Issue on Multimedia Data Mining.

Automatic medical image annotation and retrieval.
The demand for automatically annotating and retrieving medical images is growing faster than ever. In this paper, we present a novel medical image annotation method based on the proposed Semantic Error-Correcting output Codes (SECC). With this annotation method, we present a new semantic image retrieval method, which exploits the high level semantic similarity. The experimental results on the IMAGECLEF 2005 annotation data set clearly show the strength and the promise of the presented methods.
Graph Partitioning Based on Link Distributions.
Existing graph partitioning approaches are mainly based on optimizing edge cuts and do not take the distribution of edge weights (link distribution) into consideration. In this paper, we propose a general model to partition graphs based on link distributions. This model formulates graph partitioning under a certain distribution assumption as approximating the graph affinity matrix under the corresponding distortion measure. Under this model, we derive a novel graph partitioning algorithm to approximate a graph affinity matrix under various Bregman divergences, which correspond to a large exponential family of distributions. We also establish the connections between edge cut objectives and the proposed model to provide a unified view to graph partitioning.
Robust Visual Tracking Based on Incremental Tensor Subspace Learning.

Community Learning by Graph Approximation.
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we propose a general model based on graph approximation to learn link-pattern based community structures from a graph. The model generalizes the traditional graph partitioning approaches and is applicable to learning various community structures. Under this model, we derive a family of algorithms which are flexible to learn various community structures and easy to incorporate the prior knowledge of the community structures. Experimental evaluation and theoretical analysis show the effectiveness and great potential of the proposed model and algorithms. 1
Corner Detection of Contour Images using Spectral Clustering.

A Max Margin Framework on Image Annotation and Multimodal Image Retrieval.

Relational clustering by symmetric convex coding.
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of implicit objects, and are usually stored in relation matrices and typically no other knowledge is available. Although relational clustering can be formulated as graph partitioning in some applications, this formulation is not adequate for general relational data. In this paper, we propose a general model for relational clustering based on symmetric convex coding. The model is applicable to all types of relational data and unifies the existing graph partitioning formulation. Under this model, we derive two alternative bound optimization algorithms to solve the symmetric convex coding under two popular distance functions, Euclidean distance and generalized I-divergence. Experimental evaluation and theoretical analysis show the effectiveness and great potential of the proposed model and algorithms. 1.

Enhanced max margin learning on multimodal data mining in a multimedia database.
The problem of multimodal data mining in a multimedia database can be addressed as a structured prediction problem where we learn the mapping from an input to the structured and interdependent output variables. In this paper, built upon the existing literature on the max margin based learning, we develop a new max margin learning approach called Enhanced Max Margin Learning (EMML) framework. In addition, we apply EMML framework to developing an effective and efficient solution to the multimodal data mining problem in a multimedia database. The main contributions include: (1) we have developed a new max margin learning approach — the enhanced max margin learning framework that is much more efficient in learning with a much faster convergence rate, which is verified in empirical evaluations; (2) we have applied this EMML approach to developing an effective and efficient solution to the multimodal data mining problem that is highly scalable in the sense that the query response time is independent of the database scale, allowing facilitating a multimodal data mining querying to a very large scale multimedia database, and excelling many existing multimodal data mining methods in the literature that do not scale up at all; this advantage is also supported through the complexity analysis as well as empirical evaluations against a state-of-the-art multimodal data mining method from the literature. While EMML is a general framework, for the evaluation purpose, we apply it to the Berkeley Drosophila embryo image database, and report the performance comparison with a state-of-the-art multimodal data mining method.

Effective Image Retrieval Based on Hidden Concept Discovery in Image Database.

Improve Web Search Using Image Snippets.

Automatic Medical Image Annotation and Retrieval Using SECC.
The demand for automatically annotating and retrieving medical images is growing faster than ever. In this paper, we present a novel medical image annotation method based on the proposed Semantic Error-Correcting output Codes (SECC). With this annotation method, we present a new semantic image retrieval method, which exploits the high level semantic similarity. The experimental results on the IMAGECLEF 2005 annotation data set clearly show the strength and the promise of the presented methods.
Automatic Medical Image Annotation and Retrieval using SEMI%2DSECC.

Spectral clustering for multi%2Dtype relational data.
Clustering on multi-type relational data has attracted more and more attention in recent years due to its high impact on various important applications, such as Web mining, e-commerce and bioinformatics. However, the research on general multi-type relational data clustering is still limited and preliminary. The contribution of the paper is three-fold. First, we propose a general model, the collective factorization on related matrices, for multi-type relational data clustering. The model is applicable to relational data with various structures. Second, under this model, we derive a novel algorithm, the spectral relational clustering, to cluster multi-type interrelated data objects simultaneously. The algorithm iteratively embeds each type of data objects into low dimensional spaces and benefits from the interactions among the hidden structures of different types of data objects. Extensive experiments demonstrate the promise and effectiveness of the proposed algorithm. Third, we show that the existing spectral clustering algorithms can be considered as the special cases of the proposed model and algorithm. This demonstrates the good theoretic generality of the proposed model and algorithm. 1.
Unsupervised learning on k%2Dpartite graphs.

Joint categorization of queries and clips for web%2Dbased video search.

Hierarchical shadow detection for color aerial images.

BALAS Empirical Bayesian learning in the relevance feedback for image retrieval.

Guest Editors%27 introduction to the special issue machine learning approaches to multimedia information retrieval.

A probabilistic semantic model for image annotation and multi%2Dmodal image retrieval.
This paper addresses automatic image annotation problem and its application to multi-modal image retrieval. The contribution of our work is three-fold. (1) We propose a probabilistic semantic model in which the visual features and the textual words are connected via a hidden layer which constitutes the semantic concepts to be discovered to explicitly exploit the synergy among the modalities. (2) The association of visual features and textual words is determined in a Bayesian framework such that the confidence of the association can be provided. (3) Extensive evaluation on a large-scale, visually and semantically diverse image collection crawled from Web is reported to evaluate the prototype system based on the model. In the proposed probabilistic model, a hidden concept layer which connects the visual feature and the word layer is discovered by fitting a generative model to the training image and annotation words through an Expectation-Maximization (EM) based iterative learning procedure. The evaluation of the prototype system on 17,000 images and 7,736 automatically extracted annotation words from crawled Web pages for multi-modal image retrieval has indicated that the proposed semantic model and the developed Bayesian framework are superior to a state-of-the-art peer system in the literature. 1.
KDD%2FMDM 2006 The 7th KDD Multimedia Data Mining workshop report.

Semi%2DSupervised Learning Based Object Detection in Aerial Imagery.

Object Detection in Aerial Imagery Based on Enhanced Semi%2DSupervised Learning.

A Probabilistic Semantic Model for Image Annotation and Multi%2DModal Image Retrieva.

Combining Multiple Clusterings by Soft Correspondence.

Image Database Classification based on Concept Vector Model.
Automatic semantic classification of image databases is very useful for users ’ searching and browsing, but it is at the same time a very challenging research problem as well. In this paper, we develop a hidden semantic concept discovery methodology to address effective semantics-intensive image database classification. In our approach, each image in the database is segmented into regions associated with homogenous color, texture, and shape features. By exploiting regional statistical information in each image and employing a vector quantization method, a uniform and sparse regionbased representation is achieved. With this representation a probabilistic model based on statistical-hidden-class assumptions of the image database is obtained, to which the Expectation-Maximization (EM) technique is applied to analyze semantic concepts hidden in the database. Two methods are proposed to utilize the semantic concepts discovered from the probabilistic model for unsupervised and supervised image database classifications, respectively, based on the automatically learned concept vectors. It is shown that the concept vectors are more reliable and robust than the low level features. The developed methodology has a solid statistical foundation; the theoretic analysis and the experimental evaluations on a database of 10,000 generalpurpose images demonstrate its promise of the effectiveness. 1.
Co%2Dclustering by block value decomposition.
Collaborative filtering aims at predicting a test user’s ratings for new items by integrating other like-minded users ’ rating information. Traditional collaborative filtering methods usually suffer from two fundamental problems: sparsity and scalability. In this paper, we propose a novel framework for collaborative filtering by applying Orthogonal Nonnegative Matrix Tri-Factorization (ONMTF), which (1) alleviates the sparsity problem via matrix factorization; (2)solves the scalability problem by simultaneously clustering rows and columns of the user-item matrix. Experimental results on benchmark data sets are presented to show that our algorithm is indeed more tolerant against both sparsity and scalability, and achieves good performance in the meanwhile. 1
FAST Toward more effective and efficient image retrieval.

Hidden Semantic Concept Discovery in Region Based Image Retrieval.
This paper addresses Content Based Image Retrieval (CBIR), focusing on developing a hidden semantic concept discovery methodology to address effective semanticsintensive image retrieval. In our approach, each image in the database is segmented to regions associated with homogenous color, texture, and shape features. By exploiting regional statistical information in each image and employing a vector quantization method, a uniform and sparse region-based representation is achieved. With this representation a probabilistic model based on statistical-hiddenclass assumptions of the image database is obtained, to which Expectation-Maximization (EM) technique is applied to analyze semantic concepts hidden in the database. An elaborated retrieval algorithm is designed to support the probabilistic model. The semantic similarity is measured through integrating the posterior probabilities of the transformed query image, as well as a constructed negative example, to the discovered semantic concepts. The proposed approach has a solid statistical foundation and the experimental evaluations on a database of 10,000 generalpurposed images demonstrate its promise of the effectiveness. 1.
Discovering social groups without having relational data.



Semantic repository modeling in image database.

Exploiting the cognitive synergy between different media modalities in multimodal information retrieval.

Cognitive bridge between haptic impressions and texture images for subjective image retrieval.

Systematic Static Shadow Detection.

A Bayesian Framework for Automatic Concept Discovery in Image Collections.

Region Based a%2DSemantics Graph Driven Image Retrieval.

A multimodal approach to time%2Dinvariant scene retrieval from single overhead image.

A data mining approach to modeling relationships among categories in image collection.

A multimodal approach to time%2Dinvariant scene retrieval from single overhead image.

%22Automatic%22 Multimodal Medical Image Fusion.

Person Name Identification in Chinese Documents Using Finite State Automata.

Applying data mining in investigating money laundering crimes.
In this paper, we study the problem of applying data mining to facilitate the investigation of money laundering crimes (MLCs). We have identified a new paradigm of problems--- that of automatic community generation based on uni-party data, the data in which there is no direct or explicit link information available. Consequently, we have proposed a new methodology for Link Discovery based on Correlation Analysis (LDCA). We have used MLC group model generation as an exemplary application of this problem paradigm, and have focused on this application to develop a specific method of automatic MLC group model generation using Hierarchical Composition Based (HCB) correlation in the LDCA methodology. A prototype called CORAL is implemented in the MLC group model generation application, and preliminary testing and evaluations based on a real MLC case data are reported. The contributions of this work are (1) identification of the uni-party data community generation problem paradigm, (2) proposal of a new methodology LDCA to solve for problems in this paradigm, (3) formulation of the MLC group model generation problem as an example of this paradigm, (4) application of the LDCA methodology to develop a specific solution to the MLC group model generation problem by introducing HCB correlation measure using fuzzy logic, and (5) development, evaluation, and testing of the CORAL prototype in a real MLC case data. Categories and Subject Descriptors
Addressing CBIR efficiency

Knowledge Supervised Perceptual Grouping Based Qualitative Building Detection from Monocular Aerial Images.

A Unified Fuzzy Feature Indexing Scheme for Region Based Online Image Querying.

Knowledge Supervised Perceptual Grouping Based Qualitative Building Detection from Monocular Aerial Images.

Mining Surveillance Video for Independent Motion Detection.
This paper addresses the special applications of data mining techniques in homeland defense. The problem targeted, which is frequently encountered in military/intelligence surveillance, is to mine a massive surveillance video database automatically collected to retrieve the shots containing independently moving targets. A novel solution to this problem is presented in this paper, which offers a completely qualitative approach to solving for the automatic independent motion detection problem directly from the compressed surveillance video in a faster than real-time mining performance. This approach is based on the linear system consistency analysis, and consequently is called QLS. Since the QLS approach only focuses on what exactly is necessary to compute a solution, it saves the computation to a minimum and achieves the efficacy to the maximum. Evaluations from real data show that QLS delivers effective mining performance at the achieved efficiency. 1
A Clustering Based Approach to Efficient Image Retrieval.
This paper addresses the issue of effective and efficient content based image retrieval by presenting a novel indexing and retrieval methodology that integrates color, texture, and shape information for the indexing and retrieval, and applies these features in regions obtained through unsupervised segmentation, as opposed to applying them to the whole image domain. In order to address the typical color feature “inaccuracy ” problem in the literature, fuzzy logic is applied to the traditional color histogram to solve for the problem to a certain degree. The similarity is defined through a balanced combination between global and regional similarity measures incorporating all the features. In order to further improve the retrieval efficiency, a secondary clustering technique is developed and employed to significantly save query processing time without compromising the retrieval precision. An implemented prototype system has demonstrated a promising retrieval performance for a test database containing 2000 general-purpose color images, as compared with its peer systems in the literature. 1.
Subspace morphing theory for appearance based object identification.

A Web%2DBased Multimedia Diabetes Mellitus Education Tool for School Nurses.

IBMAS An Internet Based Medical Archive System.

WebSSQL %26mdash%3B A Query Language for Multimedia Web Documents.

Applications of Image Understanding in Semantics%2DOriented Multimedia Information Retrieval.

Show%26Tell A Semi%2DAutomated Image Annotation System.

Intelligent Indexing and Semantic Retrieval of Multimodal Documents.
Finding useful information from large multimodal document collections such as the WWW without encountering numerous false positives poses a challenge to multimedia information retrieval systems (MMIR). This research addresses the problem of finding pictures. The fact that images do not appear in isolation, but rather with accompanying, collateral text is exploited. Taken independently, existing techniques for picture retrieval using (i) text-based and (ii) image-based methods have several limitations. This research presents a general model for multimodal information retrieval that addresses the follow- ing issues: (i) users&#039; information need, (ii) expressing information need through composite, multimodal queries, and (iii) determining the most appropriate weighted combination of indexing techniques in order to best satisfy information need. A machine learning approach is proposed for the latter. The focus is on improving precision and recall in a MMIR system by optimally combining text and image similarity. Experiments are presented which demonstrate the utility of individual indexing systems in improving overall average precision.
Robust Gradual Scene Change Detection.

Face Detection and Its Applications in Intelligent and Focused Image Retrieval.
This paper presents a face detection technique and its applications in image retrieval. Even though this face detection method has relatively high false positives and low detection rate (as compared with the dedicated face detection systems in the literature of image understanding) , due to its simple and fast nature, it has been shown that this system may be well applied in image retrieval in certain focused application domains. Two application examples are given: one combining face detection with indexed collateral text for image retrieval regarding human beings, and the other combining face detection with conventional similarity matching techniques for image retrieval with similar background. Experimental results show that our proposed approaches have significantly improved the image retrieval precisions than the existing search engines in these focused application domains.  Key Words: Face Detection, Image Retrieval, Collateral Text, Similarity Matching, Focused Domain.  1 
Spatial Color Histograms for Content%2DBased Image Retrieval.
Color histogram is an important technique for color image database indexing and retrieving. In this paper, traditional color histogram is modified to capture spatial layout information of each color and three types spatial color histograms are introduced: annular, angular and hybrid color histograms. Experiments show that with a proper trade-off between the granularity in color dimensions and that in spatial dimensions, the performance of these histograms outperforms the traditional color histogram and some existing histogram refinement such as color coherent vector.  Keywords: Color Histogram, Spatial Color Histogram, Content-Based Image Retrieval, Annular Color Histogram, Angular Color Histogram, Hybrid Color Histogram.  1 
Exploiting Multimodal Context in Image Retrieval.

Indexing and Retrieval%2C SIGIR%2799 Workshop Summary.

Finding Pictures in Context.

Multimedia Indexing and Retrieval%2C Summary Report.

Obstacle Detection Based on Qualitative and Quantitative 3D Reconstruction.
Three different algorithms for obstacle detection are presented in this paper each  based on different assumptions. The first two algorithms are qualitative in that they  return only yes/no answers regarding the presence of obstacles in the field of view; no  3D reconstruction is performed. They have the advantage of fast determination of the  existence of obstacles in a scene based on the solvability of a linear system. The first  algorithm uses information about the ground plane, while the second only assumes  that the ground is planar. The third algorithm is quantitative in that it continuously  estimates the ground plane and reconstructs partial 3D structures by determining the  height above the ground plane of each point in the scene. Experimental results are  presented for real and simulated data, and the performance of the three algorithms  under different noise levels is compared in simulation. We conclude that in terms of  the robustness of performance, the third algorithm is ...
Automatic Calibration and Visual Servoing for a Robot Navigation System.
This paper attacks the problem of automatic location of a mobile robot in an indoor environment. This may be used for calibration to locate the robot accurately before it starts to navigate, or it can be used in visual servoing as feed back to the controller which is maintaining the robot on a course. In this paper, we examine the problem in a special case, where the ground plane is assumed to be horizontal and there are two locally parallel side-lines available. This assumption holds in many indoor environments, such as hallways, where the system&#039;s success has been demonstrated. The algorithm uses geometric features such as vanishing points and line orientations. Both theoretical analysis and experimental results show that this algorithm works very robustly and accurately. 1 INTRODUCTION  Robot navigation has been the focus of attention of many researchers in recent years. Some of the systems need to be very accurately calibrated in order to perform navigation successfully[4, 2]. Cali...
